Securing Causal Relationships in Distributed Systems

نویسندگان

  • Michael K. Reiter
  • Li Gong
چکیده

In a distributed system, it is often important to detect the causal relationships between events, where event e1 is causally before event e2 if e1 happened before e2 and could possibly have aaected the occurrence of e2. In this paper we argue that it can be essential to security that a process determine, in the face of malicious attack, how two events are causally related. We formulate attacks on causality detection in terms of causal denial and forgery, formalize possible security goals with respect to causality, and present simple algorithms to attain these goals in some situations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preventing denial and forgery of causal relationships in distributed systems

In a distributed system, it is often important to detect the causal relationships between events, where event e 1 is causally before event e 2 if e 1 happened before e 2 and could possibly have aaected the occurrence of e 2. In this paper we argue that detecting causal relationships among events can be important for security, in the sense that it may be essential to the correct implementation o...

متن کامل

HASSE: a Tool for Analyzing Causal Relationships in Parallel and Distributed Systems

As the causal relationships induced by communication between cooperating processes are crucial for understanding the dynamic behavior of parallel and distributed systems, tool support is needed for analyzing them. This paper presents hasse, a tool which graphically represents the event traces from cooperating processes according to a formal description of their causal interdependences. Hasse al...

متن کامل

Efficient Vector Time with Dynamic Process Creation and Termination

Many distributed algorithms require knowledge of the causal relationships between events. Examples include optimistic recovery protocols, distributed debugging systems, and causal distributed shared memory. Determining causal relationships can be difficult, however, because there is no global clock and local clocks cannot be perfectly synchronized. Vector time is a useful abstraction for captur...

متن کامل

SECURING INTERPRETABILITY OF FUZZY MODELS FOR MODELING NONLINEAR MIMO SYSTEMS USING A HYBRID OF EVOLUTIONARY ALGORITHMS

In this study, a Multi-Objective Genetic Algorithm (MOGA) is utilized to extract interpretable and compact fuzzy rule bases for modeling nonlinear Multi-input Multi-output (MIMO) systems. In the process of non- linear system identi cation, structure selection, parameter estimation, model performance and model validation are important objectives. Furthermore, se- curing low-level and high-level ...

متن کامل

Strongbox : a self-securing protection system for distributed programs

We introduce a new method of approaching security in distributed systems: self-securing programs. These programs run securely on distributed operating systems which provide only minimal security facilities. We have built a system called Strongbox to support self-securing programs on Mach, a distributed operating system, and Camelot, a distributed transaction facility. Strongbox uses negligible ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. J.

دوره 38  شماره 

صفحات  -

تاریخ انتشار 1995